Every Reidemeister Move Is Needed for Each Knot Type
نویسنده
چکیده
We show that every knot type admits a pair of diagrams that cannot be made identical without using Reidemeister Ω2-moves. We also show that our proof is compatible with known results for the other move types, in the sense that every knot type admits a pair of diagrams that cannot be made identical without using all of the move types.
منابع مشابه
On the Necessity of Reidemeister Moves
We show that every knot type admits a pair of diagrams that cannot be made identical without using Reidemeister Ω2-moves. We also show that our proof is compatible with known results for the other move types, in the sense that every knot type admits a pair of diagrams that cannot be made identical without using all of the move types.
متن کاملA Lower Bound for the Number of Reidemeister Moves for Unknotting
How many Reidemeister moves do we need for unknotting a given diagram of the trivial knot? Hass and Lagarias gave an upper bound. We give an upper bound for deforming a diagram of a split link to be disconnected. On the other hand, the absolute value of the writhe gives a lower bound of the number of Reidemeister I moves for unknotting. That of a complexity of knot diagram “cowrithe” works for ...
متن کاملThe Number of Reidemeister Moves Needed for Unknotting
A knot is an embedding of a circle S in a 3-manifold M , usually taken to be R or S. In the 1920’s Alexander and Briggs [2, §4] and Reidemeister [23] observed that questions about ambient isotopy of polygonal knots in R can be reduced to combinatorial questions about knot diagrams. These are labeled planar graphs with overcrossings and undercrossings marked, representing a projection of the kno...
متن کاملA polynomial invariant and the forbidden move of virtual knots
1 Preliminaries A virtual knot diagram is presented by a knot diagram having virtual crossings as well as real crossings in Fig. 1. Two virtual knot diagrams are equivalent if one can be obtained from the other by a finite sequence of generalized Reidemeister moves in Fig. 2. The equivalence class of virtual knot diagrams modulo the generalized Reidemeister moves is called a virtual knot. Virtu...
متن کاملThe Khovanov Complex for Virtual Links
In the last few years, knot theory has enjoyed a rapidly developing generalisation, the Virtual knot theory, proposed by Louis Kauffman in 1996, see [Kau2]. A virtual link is a combinatorial generalisation of the notion of classical links: we consider planar diagrams with a new crossing type allowed; this new crossing (called virtual and marked by a circle) is neither an overcrossing nor an und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006